A Signal Correlation Guided Circuit-SAT Solver

نویسندگان

  • Feng Lu
  • Li-C. Wang
  • Kwang-Ting Cheng
  • John Moondanos
  • Ziyad Hanna
چکیده

We propose two heuristics, implicit learning and explicit learning, that utilize circuit topological information and signal correlations to derive conflict clauses that could efficiently prune the search space for solving circuit-based SAT problem instances. We implemented a circuit-SAT solver SC-C-SAT based on the proposed heuristics and the concepts used in other state-of-the-art SAT solvers. For solving unsatisfiable circuit examples and for solving difficult circuit-based problems at Intel, our solver is able to achieve speedup of one order of magnitude over other state-of-the-art SAT solvers that do not use the heuristics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Global Structural Relationships of Signals to Accelerate SAT-based Combinational Equivalence Checking

We propose a novel technique to improve SAT-based Combinational Equivalence Checking (CEC). The idea is to perform a low-cost preprocessing that will statically induce global signal relationships into the original CNF formula of the miter circuit under verification, and hence reduce the complexity of the SAT instance. This efficient and effective preprocessing quickly builds up the implication ...

متن کامل

A BDD SAT Solver for Satis ability Testing: A Case Study y

The satis ability problem (SAT) is a fundamental problem in mathematical logic, constraint satisfaction, VLSI engineering, and computing theory. Methods to solve the satis ability problem play an important role in the development of computing theory and systems. In this paper, we give a BDD (Binary Decision Diagrams) SAT solver for practical asynchronous circuit design. The BDD SAT solver consi...

متن کامل

VisSAT: Visualization of SAT Solver Internals for Computer Aided Hardware Verification

Today, many applications for formal circuit verification exist that rely on solvers for Boolean satisfiability (SAT). Usually, these applications use the SAT solver as a black-box. However, exploiting information on the internals of the solving process can speed-up the treatment of the verification task. In this paper, we present the tool VisSAT. VisSAT provides insights into the internals of S...

متن کامل

Impact of SAT-Based Preprocessing on Core-Guided MaxSAT Solving

We present a formal analysis of the impact of Boolean satisfiability (SAT) based preprocessing techniques on core-guided solvers for the constraint optimization paradigm of maximum satisfiability (MaxSAT). We analyze the behavior of two solver abstractions of the core-guided approaches. We show that SAT-based preprocessing has no effect on the best-case number of iterations required by the solv...

متن کامل

Equivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation

This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight integration of a structural satisfiability (SAT) solver, BDD sweeping, and random simulation; all three working on a shared graph representation of the circuit. The BDD sweeping and SAT solver are applied in an intertw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. UCS

دوره 10  شماره 

صفحات  -

تاریخ انتشار 2004